Random matrix analysis of network Laplacians
نویسندگان
چکیده
We analyze eigenvalues fluctuations of the Laplacian of various networks under the random matrix theory framework. Analyses of random networks, scale-free networks and small-world networks show that nearest neighbor spacing distribution of the Laplacian of these networks follow Gaussian orthogonal ensemble statistics of random matrix theory. Furthermore, we study nearest neighbor spacing distribution as a function of the random connections and find that transition to the Gaussian orthogonal ensemble statistics occurs at the small-world transition.
منابع مشابه
Performance Analysis of Graph Laplacian Matrices in Detecting Protein Complexes
Detecting protein complexes is an important way to discover the relationship between network topological structure and its functional features in protein-protein interaction (PPI) network. The spectral clustering method is a popular approach. However, how to select its optimal Laplacian matrix is still an open problem. Here, we analyzed the performances of three graph Laplacian matrices (unnorm...
متن کاملHigh-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...
متن کاملSpectra of Modular and Small-World Matrices
Abstract We compute spectra of symmetric random matrices describing graphs with general modular structure and arbitrary interand intra-module degree distributions, subject only to the constraint of finite mean connectivities. We also evaluate spectra of a certain class of small-world matrices generated from random graphs by introducing shortcuts via additional random connectivity components. Bo...
متن کاملNoisy random graphs and their Laplacians
Spectra and representations of some special weighted graphs are investigated with weight matrices consisting of homogeneous blocks. It is proved that a random perturbation of the weight matrix or that of the weighted Laplacian with a “Wignernoise” will not have an effect on the order of the protruding eigenvalues and the representatives of the vertices will unveil the underlying block-structure...
متن کاملGraph Laplacians and their Convergence on Random Neighborhood Graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in several machine learning methods like semi-supervised learning, dimensionality reduction and clustering. In this paper we determine the pointwise limit of three d...
متن کامل